corrected statement regarding constraintgraph solving problem type

diff --git a/src/cargo/core/resolver/mod.rs b/src/cargo/core/resolver/mod.rs
index 8304756d1b85d3509a22fcd2178b537b23161125..105f77eba49a2ef97e5db8a5651a54edc5f55e31 100644 (file)
--- a/src/cargo/core/resolver/mod.rs
+++ b/src/cargo/core/resolver/mod.rs
@@ -6,10 +6,9 @@
 //! which is more worried about discovering crates from various sources, this
 //! module just uses the Registry trait as a source to learn about crates from.
 //!
-//! Actually solving a constraint graph is an NP-hard (or NP-complete, I forget
-//! which) problem, this the algorithm is basically a nice heuristic to make
-//! sure we get roughly the best answer most of the time. The constraints that
-//! we're working with are:
+//! Actually solving a constraint graph is an NP-hard problem. This algorithm 
+//! is basically a nice heuristic to make sure we get roughly the best answer 
+//! most of the time. The constraints that we're working with are:
 //!
 //! 1. Each crate can have any number of dependencies. Each dependency can
 //!    declare a version range that it is compatible with.